Experience Compiling Fortran to Program Dependence Graphs

نویسندگان

  • Karl J. Ottenstein
  • Steven J. Ellcey
چکیده

The program dependence graph (PDG) is being used in research projects for compilation to parallel architectures, program version integration and program semantics. This paper describes the methods used in a prototype Fortran-to-PDG translator called the PDG Testbed. Implementation decisions and details of the PDG Testbed project are described as a complement to the formal papers detailing the abstract PDG. In addition, experimental results are given that show the storage consumption for a PDG relative to a conventional internal representation as well as execution times for several analysis and optimization steps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Studies of Control Dependence Graph Size for CProgramsMary

Many tools and techniques for performing software engineering tasks require control dependence information, represented in the form of control dependence graphs. Worst-case analysis of these graphs has shown that their size may be quadratic in the number of statements in the procedure that they represent. Despite this result, two empirical studies suggest that in practice, the relationship betw...

متن کامل

Construction of Thinned Gated Single-Assignment Form

Analysis of symbolic expressions beneets from a suitable program representation. We show how to build thinned gated single-assignment (TGSA) form, a value-oriented program representation which is more complete than standard SSA form, deened on all reducible programs , and better for representing symbolic expressions than program dependence graphs or original GSA form. We present practical algor...

متن کامل

Compiling SVM-Fortran for the Intel Paragon XP/S

SVM-Fortran is a language designed t o program highly parallel systems with a global address space. A compiler for SVM-Fortran is described which generates code for parallel machines; our current target machine is the Intel Paragon X P / S with an SVMextension called ASVM. Performance numbers are given for applications and compared to results obtained with corresponding HPFversions.

متن کامل

Which Applications Can Use High Performance Fortran and Fortran-D: Industry Standard Data Parallel Languages?

In this paper, we present the first, preliminary results of HPF/Fortran-D language analysis based on compiling and running benchmark applications using a prototype implementation of HPF/Fortran-D compiler. The analysis indicate that the HPF is a very convenient tool for programming many applications on massively parallel and/or distributed systems. In addition, we cumulate experience on how to ...

متن کامل

Runtime Support and Compilation Methods for User-Specified Irregular Data Distributions

This paper describes two new ideas by which a High Performance Fortran compiler can deal with irregular computations effectively. The first mechanism invokes a user specified mapping procedure via a set of proposed compiler directives. The directives allow use of program arrays to describe graph connectivity, spatial location of array elements, and computational load. The second mechanism is a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Softw., Pract. Exper.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1992